Abduction and prime implicates, from propositional logic to equational logic

نویسندگان

  • Sophie Tourret
  • Noel De Palma
  • Marie-Christine Rousset
چکیده

Contents Motivations 4 1 State of the art for prime implicate generation in propositional logic 6 1.1 Abduction and prime implicates in propositional logic .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approach to Abductive Reasoning in Equational Logic

Abduction has been extensively studied in propositional logic because of its many applications in artificial intelligence. However, its intrinsic complexity has been a limitation to the implementation of abductive reasoning tools in more expressive logics. We have devised such a tool in ground flat equational logic, in which literals are equations or disequations between constants. Our tool is ...

متن کامل

A Rewriting Strategy to Generate Prime Implicates in Equational Logic

Generating the prime implicates of a formula consists in finding its most general consequences. This has many fields of application in automated reasoning, like planning and diagnosis, and although the subject has been extensively studied (and still is) in propositional logic, very few have approached the problem in more expressive logics because of its intrinsic complexity. This paper presents...

متن کامل

The Complexity of Restricted Consequence Finding and Abduction

We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices of target are relevant to important AI tasks, e.g. prime implicates, satisfiability, abduction and non-monotonic reasoning, and polynomial-size knowl-

متن کامل

Computing Theory Prime Implicates in Modal Logic

The algorithm to compute theory prime implicates, a generalization of prime implicates, in propositional logic has been suggested in [16]. In this paper we have extended that algorithm to compute theory prime implicates of a knowledge base X with respect to another knowledge base Y using [2], where Y is a propositional knowledge base and X |= Y , in modal system T and we have also proved its co...

متن کامل

Prime Implicates and Prime Implicants: From Propositional to Modal Logic

Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be appropriately extended from propositional logic to the modal logic K. We begin the paper by considering a number of potential definitions of clauses and terms for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012